Berth Allocation and Scheduling at Marine Container Terminals: A State-of-the-Art Review of Solution Approaches and Relevant Scheduling Attributes
نویسندگان
چکیده
Abstract Marine container terminals play a significant role for international trade networks and global market. To cope with the rapid steady growth of seaborne market, marine terminal operators must address operational challenges appropriate analytical methods to meet needs The berth allocation scheduling problem is one important decisions faced by during operations planning. optimization schedule strongly associated spatial temporal resources. An optimal robust remarkably improves productivity competitiveness seaport. A number studies have been conducted over last years. Thus, there an existing need comprehensive critical literature survey analyze state-of-the-art research progress, developing tendencies, current shortcomings, potential future directions. Therefore, this study thoroughly selected scientific manuscripts dedicated problem. identified were categorized based on attributes, including discrete, continuous, hybrid problems. detailed review was performed categories. representative mathematical formulation each category presented along summary various considerations characteristics every study. specific emphasis given solution adopted. shortcomings outlined state-of-the-art. This expectation assisting community relevant stakeholders scheduling.
منابع مشابه
Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals
A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...
متن کاملSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...
متن کاملOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Design and Engineering
سال: 2023
ISSN: ['2288-5048', '2288-4300']
DOI: https://doi.org/10.1093/jcde/qwad075